The canonical amoebot model: algorithms and concurrency control
نویسندگان
چکیده
The amoebot model abstracts active programmable matter as a collection of simple computational elements called amoebots that interact locally to collectively achieve tasks coordination and movement. Since its introduction at SPAA 2014, growing body literature has adapted assumptions for variety problems; however, without standardized hierarchy assumptions, precise systematic comparison results under the is difficult. We propose canonical model, an updated formalization distinguishes between core features families assumption variants. A key improvement addressed by concurrency. Much existing implicitly assumes actions are isolated reliable, reducing analysis sequential setting where most one time. However, real systems concurrent. formalizes all communication message passing, leveraging adversarial activation models concurrent executions. Under this granular treatment time, we take two complementary approaches algorithm design. first establish set sufficient conditions correctness any execution, embedding concurrency control directly in then present framework uses locks convert algorithms terminate satisfy certain conventions into exhibit equivalent behavior setting. As case study, demonstrate both using hexagon formation. Together, these design open new directions distributed computing research on matter.
منابع مشابه
A Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملA Survey of Concurrency Control Algorithms in the Operating Systems
Concurrency control is one of the important problems in operation systems. Various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. This paper presents a survey of the current methods for controlling...
متن کاملa survey of concurrency control algorithms in the operating systems
concurrency control is one of the important problems in operation systems. various studies have been reported to present different algorithms to address this problem, although a few attempts have been made to represent an overall view of the characteristics of these algorithms and comparison of their capabilities to each other. this paper presents a survey of the current methods for controlling...
متن کاملReposting Algorithms for Request Order Concurrency Control
The goal of concurrency control is to guarantee the correct interleaving of the operations. ROLL (Request Order Linked List) is a concurrency control method which can avoid transaction abort and minimize transaction restart. In its basic form, it requires predeclaration before a transaction is scheduled, similar to other conservative concurrency control methods, including conservative 2PL (2-Ph...
متن کاملInfinite Object Coating in the Amoebot Model
The term programmable matter refers to matter which has the ability to change its physical properties (shape, density, moduli, conductivity, optical properties, etc.) in a programmable fashion, based upon user input or autonomous sensing. This has many applications like smart materials, autonomous monitoring and repair, and minimal invasive surgery. While programmable matter might have been con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2023
ISSN: ['1432-0452', '0178-2770']
DOI: https://doi.org/10.1007/s00446-023-00443-3